https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:11731 Wed 24 Jul 2013 22:26:39 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:11704 Wed 11 Apr 2018 14:26:49 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:11706 Wed 11 Apr 2018 14:09:13 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:13018 Wed 11 Apr 2018 13:41:04 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:11707 Wed 11 Apr 2018 13:33:45 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:11708 Sat 24 Mar 2018 10:32:01 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:11701 n : X → Y with g_n(0) = 0 that are Lipschitz continuous in a neighborhood of the origin. Then pick an initial guess x₀ and find a sequence x_n by applying the iteration g_n(x_n1^-x_n)+T(x_n+1) ∋ 0 for n = 0,1,... We prove that if the Lipschitz constants of g_n are bounded by half the reciprocal of the modulus of regularity of T, then there exists a neighborhood O of x̅ (x̅ being a solution to T(x) ∋ 0) such that for each initial point x₀ ∈ O one can find a sequence x_n generated by the algorithm which is linearly convergent to x̅. Moreover, if the functions g_n have their Lipschitz constants convergent to zero, then there exists a sequence starting from x₀ ∈ O which is superlinearly convergent to x̅. Similar convergence results are obtained for the cases when the mapping T is strongly subregular and strongly regular.]]> Sat 24 Mar 2018 10:32:00 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:13044 Sat 24 Mar 2018 08:16:32 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:13045 Sat 24 Mar 2018 08:16:32 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:13056 Sat 24 Mar 2018 08:15:39 AEDT ]]>